Worst case performance bounds for multimedia flows in QoS-enhanced TNPOSS network
نویسندگان
چکیده
Network performance bounds, including the maximal end-toend (E2E) delay, the maximal jitter and the maximal buffer backlog amount, are very important for network QoS control, buffer management and network optimization. QoS-enhanced To Next-hop Port Sequence Switch (QTNPOSS) is a recently proposed transmission scheme to achieve scalable fast forwarding for multimedia applications. However, the existing E2E delay bound of QTNPOSS network is not tight. To this end, this paper presents a lower E2E delay bound for QTNPOSS networks by using the network calculus theory, where the inherent properties (e.g. packet length and peak rate) of the flow are taken into account. Besides, the buffer size bound and the jitter bound of QTNPOSS network are also presented. Moreover, by extensive numerical experiments, we discuss the influences of the Long Range Dependence (LDR) traffic property and the Weighted Fair Queuing (WFQ) weight on the proposed network performance bounds. The results show that the WFQ weight influences the bounds more greatly than the LRD property.
منابع مشابه
A Stochastic Network Calculus
The issue of Quality of Service (QoS) performance analysis in packet switched networks has drawn a lot of attention in the networking community in recent years. There is a lot of work including an elegant theory under the name of network calculus focusing on analysis of deterministic worst case QoS performance bounds. In the meantime, other researchers have studied the stochastic QoS performanc...
متن کاملMaximum End-to-End Delay of QTNPOSS Network for Multimedia Traffic
To improve the Quality of Service (QoS) ability of TNPOSS (To Next-hop Port Sequence Switch) network, this paper proposes a QoS-enhanced TNPOSS (QTNPOSS) network model by introducing Fractal Leak Bucket (FLB) shaper and Weighted Fair Queuing (WFQ) scheduler. In the proposed model, packets of multimedia traffic are shaped by the FLB shaper and scheduled by the WFQ scheduler. Moreover, the servic...
متن کاملA Stochastic Network Calculus for End-to-End QoS Performance Analysis
The issue of Quality of Service (QoS) performance analysis in packet switching networks has drawn a lot of attention in the networking community in recent years. There is a lot of work including an elegant theory under the name of network calculus focusing on analysis of deterministic worst case QoS performance bounds. In the meantime, other researchers have studied the stochastic QoS performan...
متن کاملA Stochastic Network Calculus
The issue of Quality of Service (QoS) performance analysis in packet switching networkshas drawn a lot of attention in the networking community in recent years. There is a lot ofwork including an elegant theory under the name of network calculus focusing on analysisof deterministic worst case QoS performance bounds. In the meantime, other researchershave studied the stochastic Q...
متن کاملWorst-case analysis for deterministic allocation in a differentiated services network
The Differentiated Service architecture is proposed as a scalable approach to QoS for IP networks. Therefore it is based on the aggregate (per class) scheduling of packets, but it aims at providing QoS to single flows. In particular the Expedited Forwarding (EF) Per Hop Behavior (PHB) and the related Premium Service have been defined in order to provide determinist QoS guarantees to IP flows: z...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Sci. Inf. Syst.
دوره 8 شماره
صفحات -
تاریخ انتشار 2011